On Computing Minimal Generators in Multi-Relational Data Mining with respect to theta-Subsumption

نویسندگان

  • Noriaki Nishio
  • Atsuko Mutoh
  • Nobuhiro Inuzuka
چکیده

We study the minimal generators (mingens) in multi-relational data mining. The mingens in formal concept analysis are the minimal subsets of attributes that induce the formal concepts. An intent for a formal concept is called a closed pattern. In contrast to the wide attention to closed patterns, the mingens have been paid little attention in Multi-Relational Data Mining (MRDM) field. We introduce an idea of non redundant mingens in MRDM. The notion of mingens in MRDM is led by θ-subsumption relation among patterns, and is useful to grasp the structure and information in the concepts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ideal Refinement of Datalog Clauses Using Primary Keys

Inductive Logic Programming (ILP) algorithms are frequently used to data mine multi-relational databases. However, in many ILP algorithms the use of primary key constraints is limited. We show how primary key constraints can be incorporated in a downward refinement operator. This refinement operator is proved to be finite, complete, proper and therefore ideal for clausal languages defined by pr...

متن کامل

Efficient Data Mining with Evolutionary Algorithms for Cloud Computing Application

With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...

متن کامل

Speeding Up Relational Data Mining by Learning to

he motivation behind multi-relational data mining is wledge discovery in relational databases containing tiple related tables. One difficulty relational data ing faces is managing intractably large hypothesis ces. We attempt to overcome this difficulty by first pling the hypothesis space. We generate a small set of otheses, uniformly sampled from the space of didate hypotheses, and evaluate thi...

متن کامل

(T) FUZZY INTEGRAL OF MULTI-DIMENSIONAL FUNCTION WITH RESPECT TO MULTI-VALUED MEASURE

Introducing more types of integrals will provide more choices todeal with various types of objectives and components in real problems. Firstly,in this paper, a (T) fuzzy integral, in which the integrand, the measure andthe integration result are all multi-valued, is presented with the introductionof T-norm and T-conorm. Then, some classical results of the integral areobtained based on the prope...

متن کامل

Identifying Non-Redundant Literals in Clauses with Uniqueness Propagation

Several authors have proposed increasingly efficient methods for computing the least general generalization of two clauses under theta-subsumption. The most expensive step in this computation is the reduction of the clause to its minimal size. In general, this requires testing all literals for redundancy, which in the worst case requires a thetasubsumption test for each of them. In this paper, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012